#include <stdio.h>  
#include <stdlib.h>  
#include <string.h>  
  
#define ERROR -1  
typedef int ElementType;  
typedef enum {push, pop, end} Operation;  
//typedef enum {false, true} bool;  
typedef int Position;  
typedef struct SNode *PtrToSNode;  
  
struct SNode{  
    ElementType *Data;  
    Position Top;  
    int MaxSize;  
};  
  
typedef PtrToSNode Stack;  

Stack CreateStack(int MaxSize){  
    Stack S = (Stack)malloc(sizeof(struct SNode));  
    S->Data = (ElementType *)malloc(MaxSize*sizeof(ElementType));  
    S->Top=0;  
    S->MaxSize = MaxSize;  
    return S;  
}  
  
bool Push(Stack S, ElementType X);  
ElementType Pop(Stack S);  

Operation GetOp();  
void PrintStack(Stack S);  
int main(){  
    ElementType X;  
    Stack S;  
    int N, done=0;  
    scanf("%d", &N);  
    S = CreateStack(N);  
    while(!done){  
        switch(GetOp()){  
        case push:  
            scanf("%d", &X);  
            Push(S, X);  
            break;  
        case pop:  
            X = Pop(S);  
            if(X!=ERROR)  
                printf("%d is out\n", X);  
            break;  
        case end:  
            PrintStack(S);  
            done = 1;  
            break;  
        }  
    }  
    return 0;  
}  
  
Operation GetOp(){    
    char a[5];    
    scanf("%s",a);    
    if(strcmp(a,"Push")==0)     
        return push;    
    else if(strcmp(a,"Pop")==0)     
        return pop;    
    else if(strcmp(a,"End")==0)     
        return end;      
}    
  
bool Push(Stack S, ElementType X){  
    if(S->Top-1==S->MaxSize-1){  
        printf("Stack Full\n");  
        return false;  
    }  
    S->Data[S->Top]=X;  
    S->Top++;  
    return true;  
}  
  
ElementType Pop(Stack S){  
    ElementType X;  
    if(S->Top==0){  
        printf("Stack Empty\n");  
        return ERROR;  
    }  
    S->Top--;  
    X = S->Data[S->Top];  
    return X;  
}  
  
void PrintStack(Stack S){  
    int i,n;  
  
    n = S->Top-1;  
    for(i=n;i>=0;i--)  
        printf("%d ", S->Data[i]);  
    printf("\n");  
}  

















